Confidence bounds of recurrence-based complexity measures
نویسندگان
چکیده
a r t i c l e i n f o a b s t r a c t In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confidence bounds of measured data. In the present Letter we suggest a method for estimating the confidence bounds of recurrence-based complexity measures. We study the applicability of the suggested method with model and real-life data.
منابع مشابه
Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملبهکارگیری روش غیرخطی منحنی بازگشتی برای شناسایی مؤلّفههای حافظهای برمبنای تک ثبت
Abstract: The purpose of this study was to apply recurrence plots on event related potentials (ERPs) recorded during memory recognition tests. EEG signals recorded during memory retrieval in four scalp region were used. Two most important ERP’s components corresponding to memory retrieval, FN400 and LPC, were detected in recurrence plots computed for single-trial EEGs. In addition, the RQA was ...
متن کاملتشخیص خودکار الگوهای پاتولوژیک ریوی در تصاویر HRCT بیماران مبتلا به ILD
Abstract: The purpose of this study was to apply recurrence plots on event related potentials (ERPs) recorded during memory recognition tests. EEG signals recorded during memory retrieval in four scalp region were used. Two most important ERP’s components corresponding to memory retrieval, FN400 and LPC, were detected in recurrence plots computed for single-trial EEGs. In addition, the RQA was ...
متن کاملCognitive Task Complexity and Iranian EFL Learners’ Written Linguistic Performance across Writing Proficiency Levels
Recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. This study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient EFL Iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...
متن کاملOFFPRINT Recurrence plots 25 years later — Gaining confidence in dynamical transitions
Recurrence-plot–based time series analysis is widely used to study changes and transitions in the dynamics of a system or temporal deviations from its overall dynamical regime. However, most studies do not discuss the significance of the detected variations in the recurrence quantification measures. In this letter we propose a novel method to add a confidence measure to the recurrence quantific...
متن کامل